An automatic theorem prover for substitution and detachment systems.
نویسندگان
چکیده
منابع مشابه
My Life with an Automatic Theorem Prover
Sledgehammer integrates third-party automatic theorem provers in the proof assistant Isabelle/HOL. In the seven years since its first release in 2007, it has grown to become an essential part of most Isabelle users’ workflow. Although a lot of effort has gone into tuning the system, the main reason for Sledgehammer’s success is the impressive power of the external provers, especially E, SPASS, ...
متن کاملSystem Description: ARA - An Automatic Theorem Prover for Relation Algebras
aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow first-order finite variable proofs. Employing results from Tarski/Givant and Maddux we can prove validity in the theories of simple semi-associative relation algebras, relation algebras and representable relation algebras using t...
متن کاملIleantap: an Intuitionistic Theorem Prover Ileantap: an Intuitionistic Theorem Prover
We present a Prolog program that implements a sound and complete theorem prover for rst-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string uniica-tion to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the diierent logical connectives the implementation can easily be adapted to deal with other n...
متن کاملAn Improved HHL Prover: An Interactive Theorem Prover for Hybrid Systems
Hybrid systems are integrations of discrete computation and continuous physical evolution. To guarantee the correctness of hybrid systems, formal techniques on modelling and verification of hybrid systems have been proposed. Hybrid CSP (HCSP) is an extension of CSP with differential equations and some forms of interruptions for modelling hybrid systems, and Hybrid Hoare logic (HHL) is an extens...
متن کاملLogical Ontology Validation Using an Automatic Theorem Prover
Ontologies are utilized for a wide range of tasks, like information retrieval/extraction or text generation, and in a multitude of domains, such as biology, medicine or business and commerce. To be actually usable in such real-world scenarios, ontologies usually have to encompass a large number of factual statements. However, with increasing size, it becomes very difficult to ensure their compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1978
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093888213